A generalized setting for fixpoint theory

A Fixpoint Theory for Non-monotonic Parallelism

A Fixpoint Theory for Non-monotonic Parallelism

This paper studies parallel recursion. The trace specification language used in this paper incorporates sequentiality, nondeterminism, reactiveness (including infinite traces), three forms of parallelism (including conjunctive, fair-interleaving and synchronous parallelism) and general recursion. In order to use Tarski’s theorem to determine the fixpoints of recursions, we need to identify a we...

Alternating Fixpoint Theory for Logic Programswith

Mixed Fixpoint Theory for Disjunktive Deductive Databases

This paper deals with state generation and model generation for minimal model reasoning. We review the xpoint theory of two immediate consequence operators for databases, cf. also LoMiRa 92] and Fe 93], and prove some useful connections between them. For positive-disjunctive databases D, the rst operator T s D is based on hyperresolution. It operates on disjunctice Herbrand states and its least...

A Setting for Generalized Orthogonalization

Let H be a complex Hilbert space. We study the geometry of the space of pairs (A,E), for A a (semidefinite bounded linear) positive operator on H and E a (bounded linear) projection on H such that AE = E∗A. Departamento de Matemática, Facultad de Ingenieŕıa,UBA, Buenos Aires(C1063ACV), Argentina; Instituto Argentino de Matemática CONICET, Saavedra 15, Buenos Aires (1083), Argentina. E-mail addr...